Parallel Computation of Gröbner Bases on Distributed Memory Machines
نویسندگان
چکیده
منابع مشابه
Parallel and distributed Gröbner bases computation in JAS
This paper considers parallel Gröbner bases al-gorithms on distributed memory parallel comput-ers with multi-core compute nodes. We summa-rize three different Gröbner bases implementations:shared memory parallel, pure distributed memoryparallel and distributed memory combined withshared memory parallelism. The last algorithm,called distributed hybrid, uses only one c...
متن کاملThe computation of Gröbner bases on a shared memory multiprocessor
The principal result described in this report is the design and implementation of a parallel version of Buchberger's algorithm. Its correctness is stated and some experimental results are given. The first parts are devoted to a partial review of Grobner bases, of Buchberger's algorithm which computes them, and of some of their applications.
متن کاملComputation of Difference Gröbner Bases
This paper is an updated and extended version of our note [1] (cf. also [2]). To compute difference Gröbner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the package LDA (Linear Difference Algebra) and we describe the main features of the pa...
متن کاملVector Prefix and Reduction Computation on Coarse-Grained, Distributed-Memory Parallel Machines
Vector prefix and reduction are collective communication primitives in which all processors must cooperate. We present two parallel algorithms, the direct algorithm and the split algorithm, for vector prefix and reduction computation on coarse-grained, distributed-memory parallel machines. Our algorithms are relatively architecture independent and can be used effectively in many applications su...
متن کاملParallel Implementations of Perceptual Grouping Tasks on Distributed Memory Machines
(Summary of Results) Abstract In this paper, we propose parallel implementations for solving Perceptual Grouping tasks on distributed memory machines. Our implementations show that, given 7K line segments extracted from a 1K 1K image, the Line Grouping task can be performed in 0.486 seconds using a partition of CM-5 having 256 processing nodes and in 0.382 seconds using a 16-node Cray T3D. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1994
ISSN: 0747-7171
DOI: 10.1006/jsco.1994.1045